Distributed Trust in Open Multi-agent Systems

نویسندگان

  • Yosi Mass
  • Onn Shehory
چکیده

Facilitated by the rapid growth of the Internet, electronic commerce is growing exponentially. As a result, millions of players participate in electronic trade, yet many of these players are strangers to each other. This implies mistrust, which may bring about manipulative and malicious trade behaviors among the parties. This problem intensifies in electronic environments where agents act on behalf of humans. There, self-interested, utility-maximizing agents, have a strong motivation, and no moral means against, malicious action. Attempts to prevent such misbehavior usually concentrate on designing non-manipulable mechanisms. Yet, these tend to be either computationally intractable or sub-optimal. We suggest a new approach: a mechanism that allows agents in an open system to establish trust among themselves and to dynamically update this trust. Although we rely on certificates for our solution, we do not require (in contrast to previous solutions) any centralized certificate authority system, nor do we require some well known, trusted parties. Our solution is fully distributed, it is computationally feasible, and can be easily added to any agent architecture.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Verification of Trust in Distributed Open Systems

In open and distributed systems, agents must engage in interactions of which they have no previous experience. Deontic models are widely used to describe aspects of permission, obligation, and trust anticipated by such agents, but no practical mechanism has been developed for testing deontic trust specifications against models of multi-agent interactions. This paper describes a way of doing thi...

متن کامل

On Security in Open Multi-Agent Systems

In open multi-agent systems agents must interact with other agents with which they are not familiar. In particular, an agent will receive requests and assertions from other agents and must decide how to act on the requests and assess the credibility of the assertions. In a closed environment, agents have well known and familiar transaction partners whose rights and credibility are known. The pr...

متن کامل

Decentralized Reputation Management for Cooperating Software Agents in Open Multi-Agent Systems

Multi-Agent Systems (MAS) promise a new advance in distributed computing. In MAS autonomous software agents flexibly cooperate, coordinate and compete to provide the desired function(s) of such a system. If some components of a MAS fail or do not provide the desired functionality, the system is expected to autonomously deal with this situation. It is desirable to reduce occurrences of such situ...

متن کامل

Adaptive Distributed Consensus Control for a Class of Heterogeneous and Uncertain Nonlinear Multi-Agent Systems

This paper has been devoted to the design of a distributed consensus control for a class of uncertain nonlinear multi-agent systems in the strict-feedback form. The communication between the agents has been described by a directed graph. Radial-basis function neural networks have been used for the approximation of the uncertain and heterogeneous dynamics of the followers as well as the effect o...

متن کامل

Multi-contextual Trust Model for Multi-Agent Systems

This paper deals with trust modelling for distributed systems especially to multi-context trust modelling for multiagent distributed systems. There exists many trust and reputation models but most of them do not dealt with the multi-context property of trust or reputation. Therefore, the main focus of this thesis is on analysis of multicontext trust based models and provides main assumptions fo...

متن کامل

Optimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems

In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000